Complexity Adjusted Soft-Output Sphere Decoding by Adaptive LLR Clipping
نویسندگان
چکیده
منابع مشابه
Soft-Input Soft-Output Single Tree-Search Sphere Decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for practical receiver implementations, in particular in the context of multiple-input multiple-output (MIMO) wireless communication systems. In this paper, we present a low-complexity SISO sphere-decoding algorithm, based on...
متن کاملTowards complexity-reduced Soft-Input Soft-Output Sphere Detection
Iterative detection↔decoding is a powerful approach for wireless multiple-input multiple output (MIMO) transmission to achieve very high detection performance, but comes at the costs of high processing complexity at the receiver side. In order to enable efficient hardware realizations, it is necessary to suitably reduce the inherent increase in complexity when a-priori information (i.e. soft-in...
متن کاملParallel High Throughput Soft-Output Sphere Decoding Algorithm
Multiple-Input-Multiple-Output communication systems demand fast sphere decoding with high performance. To speed up the computation, we propose a scheme with multiple fixed complexity sphere decoders to construct a parallel soft-output fixed complexity sphere decoder (PFSD). The proposed decoder is highly parallel and has performance comparable to softoutput list fixed complexity sphere decoder...
متن کاملDecoding by Sampling - Part II: Derandomization and Soft-Output Decoding
In this paper, a derandomized algorithm for sampling decoding is proposed to achieve near-optimal performance in lattice decoding. By setting a probability threshold to sample candidates, the whole sampling procedure becomes deterministic, which brings considerable performance improvement and complexity reduction over to the randomized sampling. Moreover, the upper bound on the sample size K, w...
متن کاملLow-complexity soft-decoding algorithms for Reed-Solomon codes-part II: soft-input soft-output iterative decoding
In this work we present a practical approach to the iterative decoding of Reed-Solomon (RS) codes. The presented methodology utilizes an architecture in which the output produced by steps of Belief-Propagation (BP) is successively applied to a legacy decoding algorithm. Due to the suboptimal performance of BP conducted on the inherently dense RS parity-check matrix, a method is first provided f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2011
ISSN: 1089-7798
DOI: 10.1109/lcomm.2011.061011.110516